Temporal Query Processing with Indeenite Information

نویسنده

  • Peter van Beek
چکیده

Time is an important aspect of information in medical domains. In this paper, we adopt Allen's innuential interval algebra framework for representing temporal information. The interval algebra allows the representation of indeenite and incomplete information which is necessary in many applications. However, answering interesting queries in this framework has been shown to be almost assuredly intractable. We show that when the representation language is suuciently restricted we can develop eecient algorithms for answering interesting classes of queries including: (i) determining whether a formula involving temporal relations between events is possibly true and necessarily true; and (ii) answering aggregation questions where the set of all events that satisfy a formula are retrieved. We also show, by examining applications of the interval algebra discussed in the literature, that our restriction on the representation language often is not overly restrictive in practice.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Database Models for Innnite and Indeenite Temporal Information

Representation and querying of temporal information can beneet from the integration of techniques from constraint databases, database models for indeenite information and reasoning about temporal constraints. With this perspective in mind, we present a hierarchy of temporal data models: temporal relations, generalized temporal relations and temporal tables. We study the semantics of these model...

متن کامل

The Complexity of Query Evaluation in Indefinite Temporal Constraint Databases

In previous work we have developed the scheme of indeenite L-constraint databases where L, the parameter, is a rst-order constraint language. This scheme extends the constraint database proposal of Kanellakis, Kuper and Revesz to include in-deenite (or uncertain) information in the style of Imielinski and Lipski. In this paper we study the complexity of query evaluation in an important instance...

متن کامل

Databases and Temporal Constraints :

We continue the development of a theory of constraint databases with indeenite information which we originated in our previous research. Initially we review the schemes of L-constraint databases and indeenite L-constraint databases where L, the parameter, is a rst-order constraint language. Then we consider several instances of these schemes where L is a language for expressing information abou...

متن کامل

Foundations of Indeenite Constraint Databases

We lay the foundations of a theory of constraint databases with indeenite information based on the relational model. We develop the scheme of indeenite L-constraint databases where L, the parameter, is a rst-order constraint language. This scheme extends the proposal of Kanellakis, Kuper and Revesz to include indeenite information in the style of Imielinski and Lipski. We propose declarative an...

متن کامل

Representation and Querying in Temporal Databases: the Power of Temporal Constraints

We propose a data model capable of representing deenite, indeenite, nite and innnite temporal information in a simple but powerful framework. Our model is based on temporal tables i.e., relation-like representations which can contain variables constrained by formulas of a temporal logic. We deene an algebraic and a calculus query language for temporal tables and present a detailed analysis of t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1991